package leetcode.code0525;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution525 implements IDebug {


	public abstract int findMaxLength(int[] nums);

	@Override
	public void debug1() {
		int r = this.findMaxLength(HelpDebug.str2array3("[0,1]"));
		HelpDebug.compare(2, r);

	}

	@Override
	public void debug2() {
		int r = this.findMaxLength(HelpDebug.str2array3("[0,1,0]"));
		HelpDebug.compare(2, r);

	}

	@Override
	public void debug3() {
		int r = this.findMaxLength(HelpDebug.str2array3("[0,1,0,1,1,1,0,0,0,0,1,1]"));
		HelpDebug.compare(12, r);

	}

	@Override
	public void debug4() {
		int r = this.findMaxLength(HelpDebug.str2array3("[0,0,1]"));
		HelpDebug.compare(2, r);

	}
	public void debug5() {
		int r = this.findMaxLength(HelpDebug.str2array3("[1,1,1,1,1,1,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0,1,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,1,1,1,1,0,0,1,0,1,1,0,1,1,1,1,0,1,0,0,1,0,1,1,1,1,0,1,0,0,0,0,0,0,1,0,0,1,1,1,0,1,0,1,0,1,1,0,1,1,0,1,1,0,1,0,0,0]"
				));
		HelpDebug.compare(96, r);

	}

	public void debug6() {
		int r = this.findMaxLength(HelpDebug.str2array3("[0,1,0,1,1,1,0,0,1,1,0,1,1,1,1,1,1,0,1,1,0,1,1,0,0,0,1,0,1,0,0,1,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,1,1,1,0,1,0,0,1,1,1,1,1,0,0,1,1,1,1,0,0,1,0,1,1,0,0,0,0,0,0,1,0,1,0,1,1,0,0,1,1,0,1,1,1,1,0,1,1,0,0,0,1,1]"));
		HelpDebug.compare(68, r);
	}
}
